Goto

Collaborating Authors

 cp-based approach


A CP-Based Approach for Popular Matching

Chisca, Danuta Sorina (University College Cork) | Siala, Mohamed (University College Cork) | Simonin, Gilles (University College Cork) | O' (University College Cork) | Sullivan, Barry

AAAI Conferences

We propose a constraint programming approach to the popular matching problem. We show that one can use the Global Cardinality Constraint to encode the problem even in cases that involve ties in the ordinal preferences of the applicants.


A CP-Based Approach for Popular Matching

Chisca, Danuta Sorina (University College Cork) | Siala, Mohamed (University College Cork) | Simonin, Gilles (University College Cork) | O' (University College Cork) | Sullivan, Barry

AAAI Conferences

Different formulations are proposed, distinguishing The notion of popular matching was introduced by (Gardenfors between one-sided matching (Garg et al. 2010) and twosided 1975), but this notion has its roots in the 18th century matching, e.g. the stable marriage (SM) problem (Gale and the notion of a Condorcet winner.